Bayesian optimal knapsack procurement
نویسندگان
چکیده
A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer’s problem is to select a subset of maximal quality. Money does not enter the buyer’s objective function, but only his constraints. Sellers quote prices strategically, inducing a knapsack game. We report the Bayesian optimal mechanism for the buyer’s problem. We find that simultaneous takeit-or-leave-it offers are interim optimal. JEL D21, D44, D45, D82.
منابع مشابه
Truthful Multi-unit Procurements with Budgets
We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment. For a special class of procurement games, the bounded knapsack problem, we show that no universally truthful budget-fe...
متن کاملNonconvex piecewise linear knapsack problems
This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand, the optimization problem is to choose ...
متن کاملEx-post optimal knapsack procurement
We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project’s cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects both which and how many is endogenously determined by the mechanism. The designer faces ex-post constraints: The participation and budget constrai...
متن کاملEfficiently Generating k-Best Solutions to Procurement Auctions
© Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, decision support, combinatorial optimization, knapsack problems, k-shortest paths Procurement executives often find it difficult to articulate their preferences and constraints regarding auctions, making it difficult to cas...
متن کاملPareto Bayesian Optimization Algorithm for the Multiobjective 0/1 Knapsack Problem
This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the Pareto bi-criteria optimization of the 0/1 knapsack problem. The main attention is focused on the incorporation of the Pareto optimality concept into classical structure of the BOA algorithm. We have modified the standard algorithm BOA for one criterion optimization utilizing the known niching techniques to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 234 شماره
صفحات -
تاریخ انتشار 2014